Incremental Minimum Flow Algorithms

There are various situations in which real-world problems can be modeled and solved as minimum flow problems. Sometimes, these situations, minor data changes may occur, leading to corresponding of the networks practical problems, such slight variations capacity or lower bound. For instance, bound an arc increase decrease time, leaving one with no other choice than finding new network flow. Given both ways changed high frequency changes, it is desirable find fast a computation method for possible. This paper focused on cases that concern increasing decreasing arc. cases, algorithms dynamic already known inefficient. Our incremental determining modified more efficient above-mentioned types algorithms. The proposed starts from initial solves problem significantly faster way recalculating starting scratch.